@inproceedings{DBLP:conf/vldb/LvJWCL07,
  author    = {Q. Lv and
               W. Josephson and
               Z. Wang and
               M. Charikar and
               K. Li},
  title     = {Multi-Probe {LSH:} Efficient Indexing for High-Dimensional Similarity
               Search},
  booktitle = {VLDB},
  pages     = {950--961},
  year      = {2007}
}
@article{DBLP:journals/corr/FuC16,
  author    = {C. Fu and
               D. Cai},
  title     = {{EFANNA} : An Extremely Fast Approximate Nearest Neighbor Search Algorithm
               Based on kNN Graph},
  journal   = {CoRR},
  volume    = {abs/1609.07228},
  year      = {2016}
}
@inproceedings{DBLP:conf/ijcai/HajebiASZ11,
  author    = {K. Hajebi and
               Y. Yadkori and
               H. Shahbazi and
               H. Zhang},
  title     = {Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph},
  booktitle = {IJCAI},
  pages     = {1312--1317},
  year      = {2011}
}
@inproceedings{DBLP:conf/sigmod/WuJZ14,
  author    = {Y. Wu and
               R. Jin and
               X. Zhang},
  title     = {Fast and unified local search for random walk based k-nearest-neighbor
               query in large graphs},
  booktitle = {SIGMOD},
  pages     = {1139--1150},
  year      = {2014}
}
@inproceedings{DBLP:reference/gis/HadjieleftheriouMTT17,
  author    = {M. Hadjieleftheriou and
               Y. Manolopoulos and
               Y. Theodoridis and
               V. J. Tsotras},
  title     = {R-Trees: {A} Dynamic Index Structure for Spatial Searching},
  booktitle = {Encyclopedia of {GIS}},
  year      = {2017}
}
@inproceedings{DBLP:conf/vldb/SakuraiYUK00,
  author    = {Y. Sakurai and
               M. Yoshikawa and
               S. Uemura and
               H. Kojima},
  title     = {The A-tree: An Index Structure for High-Dimensional Spaces Using Relative
               Approximation},
  booktitle = {VLDB},
  pages     = {516--526},
  year      = {2000}
}
@article{DBLP:journals/pvldb/SatuluriP12,
  author    = {V. Satuluri and
               S. Parthasarathy},
  title     = {Bayesian Locality Sensitive Hashing for Fast Similarity Search},
  journal   = {Proceedings of the VLDB Endowment},
  volume    = {5},
  number    = {5},
  pages     = {430--441},
  year      = {2012}
}
@article{DBLP:journals/pami/WangZSSS18,
  author    = {J. Wang and
               T. Zhang and
               J. Song and
               N. Sebe and
               H. Shen},
  title     = {A Survey on Learning to Hash},
  journal   = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  volume    = {40},
  number    = {4},
  pages     = {769--790},
  year      = {2018}
}
@article{DBLP:journals/pami/GongLGP13,
  author    = {Y. and
               S. Lazebnik and
               A. Gordo and
               F. Perronnin},
  title     = {Iterative Quantization: {A} Procrustean Approach to Learning Binary
               Codes for Large-Scale Image Retrieval},
  journal   = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  volume    = {35},
  number    = {12},
  pages     = {2916--2929},
  year      = {2013}
}
@inproceedings{DBLP:conf/cvpr/SchindlerBS07,
  author    = {G. Schindler and
               M. A. Brown and
               R. Szeliski},
  title     = {City-Scale Location Recognition},
  booktitle = {CVPR},
  publisher = {{IEEE} Computer Society},
  year      = {2007}
}
@article{clustering,
	author = {M. Steinbach, G. Karypis, V. Kumar.},
	year = {2000},
	title = {A comparison of document clustering techniques},
	journal = {KDD Workshop on Text Mining}
} 
@article{DBLP:journals/corr/abs-1905-10987,
  author    = {D. Baranchuk and
               D. Persiyanov and
               A. Sinitsin and
               A. Babenko},
  title     = {Learning to Route in Similarity Graphs},
  journal   = {CoRR},
  volume    = {abs/1905.10987},
  year      = {2019},
}
@article{DBLP:journals/pvldb/SunWQZL14,
  author    = {Y. Sun and
               W. Wang and
               J. Qin and
               Y. Zhang and
               X. Lin},
  title     = {{SRS:} Solving c-Approximate Nearest Neighbor Queries in High Dimensional
               Euclidean Space with a Tiny Index},
  journal   = {Proceedings of the VLDB Endowment},
  volume    = {8},
  number    = {1},
  pages     = {1--12},
  year      = {2014},
}
@article{DBLP:journals/pvldb/AroraSK018,
  author    = {A. Arora and
               S. Sinha and
               P. Kumar and
               A. Bhattacharya},
  title     = {HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate
               kNN Search in High-Dimensional Spaces},
  journal   = {Proceedings of the VLDB Endowment},
  volume    = {11},
  number    = {8},
  pages     = {906--919},
  year      = {2018},

}
@article{A:flann,
  author    = {Marius Muja and
               David G. Lowe},
  title     = {Scalable Nearest Neighbor Algorithms for High Dimensional Data},
  journal   = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  volume    = {36},
  number    = {11},
  pages     = {2227--2240},
  year      = {2014}
}



@article{2010Introduction,
  title={Introduction to Information Retrieval},
  author={ R. R. Larson},
  journal={The Journal of the Association for Information Science and Technology},
  volume={61},
  number={4},
  pages={852-853},
  year={2010},
}

@article{2013Hadoop,
  title={Hadoop's adolescence: an analysis of Hadoop usage in scientific workloads},
  author={K. Ren and  Y. Kwon  and  M. Balazinska  and  B. Howe },
  journal={Proceedings of the VLDB Endowment},
  volume={6},
  number={10},
  pages={853-864},
  year={2013},
}


@article{DBLP:journals/pami/MujaL14,
  author    = {M. Muja and
               D. G. Lowe},
  title     = {Scalable Nearest Neighbor Algorithms for High Dimensional Data},
  journal   = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  volume    = {36},
  number    = {11},
  pages     = {2227--2240},
  year      = {2014}
}
@article{DBLP:journals/pvldb/ZhengZWHLJ20,
  author    = {B. Zheng and
               X. Zhao and
               L. Weng and
               N. Q. Hung and
               H. Liu and
               C. S. Jensen},
  title     = {{PM-LSH:} {A} Fast and Accurate {LSH} Framework for High-Dimensional
               Approximate {NN} Search},
  journal   = {Proceedings of the VLDB Endowment},
  volume    = {13},
  number    = {5},
  pages     = {643--655},
  year      = {2020}
}
@book{DBLP:books/ph/PapadimitriouS82,
  author    = {C. H. Papadimitriou and
               K. Steiglitz},
  title     = {Combinatorial Optimization: Algorithms and Complexity},
  publisher = {Prentice-Hall},
  year      = {1982}
}
@article{DBLP:journals/kais/WuW19,
  author    = {Minghui Wu and
               Xindong Wu},
  title     = {On big wisdom},
  journal   = {Knowledge and Information Systems},
  volume    = {58},
  number    = {1},
  pages     = {1--8},
  year      = {2019},
  url       = {https://doi.org/10.1007/s10115-018-1282-y},
  doi       = {10.1007/s10115-018-1282-y},
  timestamp = {Tue, 29 Jan 2019 16:03:22 +0100},
  biburl    = {https://dblp.org/rec/journals/kais/WuW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tree1,
  author    = {Askar Obulkasim and
               Gerrit A. Meijer and
               Mark A. van de Wiel},
  title     = {Semi-supervised adaptive-height snipping of the hierarchical clustering
               tree},
  journal   = {{BMC} Bioinform.},
  volume    = {16},
  pages     = {15:1--15:11},
  year      = {2015}
}
@article{DBLP:tree2,
  author    = {Wen Li and
               Ying Zhang and
               Yifang Sun and
               Wei Wang and
               Mingjie Li and
               Wenjie Zhang and
               Xuemin Lin},
  title     = {Approximate Nearest Neighbor Search on High Dimensional Data - Experiments,
               Analyses, and Improvement},
  journal   = {IEEE Transactions on Knowledge and Data Engineering.},
  volume    = {32},
  number    = {8},
  pages     = {1475--1488},
  year      = {2020}
}
@inproceedings{DBLP:tree3,
  author    = {K. G. Renga Bashyam and
               Sathish Vadhiyar},
  title     = {Fast Scalable Approximate Nearest Neighbor Search for High-dimensional
               Data},
  booktitle = {CLUSTER},
  pages     = {294--302},
  publisher = {{IEEE}},
  year      = {2020}
}
@article{DBLP:tree4,
  author    = {Yingfan Liu and
               Hao Wei and
               Hong Cheng},
  title     = {Exploiting lower bounds to accelerate approximate nearest neighbor
               search on high-dimensional data},
  journal   = {Information Sciences},
  volume    = {465},
  pages     = {484--504},
  year      = {2018}
}
@inproceedings{DBLP:tree5,
  author    = {David M. Mount},
  editor    = {Sudebkumar Prasant Pal and
               Ambat Vijayakumar},
  title     = {New Directions in Approximate Nearest-Neighbor Searching},
  booktitle = {CALDAM},
  series    = {Lecture Notes in Computer Science},
  volume    = {11394},
  pages     = {1--15},
  publisher = {Springer},
  year      = {2019}
}
@article{CHEN2019145,
title = {Fast neighbor search by using revised k-d tree},
journal = {Information Sciences},
volume = {472},
pages = {145-162},
year = {2019},
issn = {0020-0255},
    author = {Yewang Chen and Lida Zhou and Yi Tang and Jai Puneet Singh and Nizar Bouguila and Cheng Wang and Huazhen Wang and Jixiang Du}
}
@inproceedings{DBLP:conf/sigmod/ZhangCYMR20,
      author    = {Huayi Zhang and
                   Lei Cao and
                   Yizhou Yan and
                   Samuel Madden and
                   Elke A. Rundensteiner},
      title     = {Continuously Adaptive Similarity Search},
      booktitle = {SIGMOD 2020},
      pages     = {2601--2616},
      publisher = {{ACM}},
      year      = {2020}
}
@inproceedings{DBLP:conf/icml/SilverLHDWR14,
author             = {David Silver and
               Guy Lever and
               Nicolas Heess and
               Thomas Degris and
               Daan Wierstra and
               Martin A. Riedmiller},
  title     = {Deterministic Policy Gradient Algorithms},
  booktitle = {Proceedings of the 31th International Conference on Machine Learning,
               {ICML} 2014, Beijing, China, 21-26 June 2014},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {32},
  pages     = {387--395},
  publisher = {JMLR.org},
  year      = {2014},
  url       = {http://proceedings.mlr.press/v32/silver14.html},
  timestamp = {Wed, 29 May 2019 08:41:46 +0200},
  biburl    = {https://dblp.org/rec/conf/icml/SilverLHDWR14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{2018Learning,
  title={Learning Permutations with Sinkhorn Policy Gradient},
  author={ Emami, P.  and  Ranka, S. },
  year={2018},
}
@article{2015Batch,
  title={Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift},
  author={ Ioffe, Sergey  and  Szegedy, Christian },
  journal={JMLR.org},
  year={2015},
}
@book{1998Reinforcement,
  title={Reinforcement Learning:An Introduction},
  author={ Sutton, R.  and  Barto, A. },
  publisher={Reinforcement Learning:An Introduction},
  year={1998},
}
@article{Bellman1966Dynamic,
  title={Dynamic Programming},
  author={Bellman and R.},
  journal={Science},
  volume={153},
  number={3731},
  pages={34-37},
  year={1966},
}
@article{0A,
  title={A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play},
  author={ Silver, D.  and  Hubert, T.  and  Schrittwieser, J.  and  Antonoglou, I.  and  Lai, M.  and  Guez, A.  and  Lanctot, M.  and  Sifre, L.  and  Kumaran, D.  and  Graepel, T. },
  journal={Science},
  volume={362},
}
@article{1994On,
  title={On-Line Q-Learning Using Connectionist Systems},
  author={ Rummery, G. A.  and  Niranjan, M. },
  journal={Technical Report},
  year={1994},
}
@article{1992Q,
  title={Q-learning. machine learning},
  author={ Christopher, J. },
  journal={Machine Learning},
  volume={3},
  year={1992},
}
@article{2018Variance,
  title={Variance Reduction for Reinforcement Learning in Input-Driven Environments},
  author={ Mao, H.  and  Venkatakrishnan, S. B.  and  Schwarzkopf, M.  and  Alizadeh, M. },
  year={2018},
}
@article{2013Playing,
  title={Playing Atari with Deep Reinforcement Learning},
  author={ Mnih, V.  and  Kavukcuoglu, K.  and  Silver, D.  and  Graves, A.  and  Antonoglou, I.  and  Wierstra, D.  and  Riedmiller, M. },
  journal={Computer Science},
  year={2013},
}
@article{1999Policy,
  title={Policy Gradient Methods for Reinforcement Learning with Function Approximation},
  author={ Sutton, R. S.  and  Mcallester, D.  and  Singh, S.  and  Mansour, Y. },
  journal={Submitted to Advances in Neural Information Processing Systems},
  volume={12},
  year={1999},
}
@article{0Reward,
  title={Reward is enough},
  author={ Silver, D.  and  Singh, S.  and  Precup, D.  and  Sutton, R. S. },
  journal={Artificial Intelligence},
  volume={299},
}
@article{2015Continuous,
  title={Continuous control with deep reinforcement learning},
  author={ Lillicrap, Timothy P.  and  Hunt, Jonathan J.  and  Pritzel, Alexander  and  Heess, Nicolas  and  Erez, Tom  and  Tassa, Yuval  and  Silver, David  and  Wierstra, Daan },
  journal={Computer ence},
  year={2015},
}
@article{2002Journal,
  title={Journal of Machine Learning Research 3 (2002) 397-422 Submitted 11/01; Published 11/02 Using Confidence Bounds for},
  author={ Auer, P.  and  Long, M. },
  year={2002},
}
@article{1933On,
  title={On the Likelihood That One Unknown Probability Exceeds Another in View of the Evidence of Two Samples},
  author={ Thompson, W. R. },
  journal={Biometrika},
  volume={25},
  number={3-4},
  pages={285-294},
  year={1933},
}

@article{DBLP:journals/cacm/Bentley75,
  author    = {Jon Louis Bentley},
  title     = {Multidimensional Binary Search Trees Used for Associative Searching},
  journal   = {Commun. {ACM}},
  volume    = {18},
  number    = {9},
  pages     = {509--517},
  year      = {1975},
  url       = {http://doi.acm.org/10.1145/361002.361007},
  doi       = {10.1145/361002.361007},
  timestamp = {Wed, 14 Nov 2018 10:22:32 +0100},
  biburl    = {https://dblp.org/rec/journals/cacm/Bentley75.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toms/FriedmanBF77,
  author    = {Jerome H. Friedman and
               Jon Louis Bentley and
               Raphael A. Finkel},
  title     = {An Algorithm for Finding Best Matches in Logarithmic Expected Time},
  journal   = {{ACM} Trans. Math. Softw.},
  volume    = {3},
  number    = {3},
  pages     = {209--226},
  year      = {1977},
  url       = {https://doi.org/10.1145/355744.355745},
  doi       = {10.1145/355744.355745},
  timestamp = {Wed, 14 Nov 2018 10:12:56 +0100},
  biburl    = {https://dblp.org/rec/journals/toms/FriedmanBF77.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/visapp/MujaL09,
  author    = {Marius Muja and
               David G. Lowe},
  editor    = {Alpesh Ranchordas and
               Helder Ara{\'{u}}jo},
  title     = {Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration},
  booktitle = {{VISAPP} 2009 - Proceedings of the Fourth International Conference
               on Computer Vision Theory and Applications, Lisboa, Portugal, February
               5-8, 2009 - Volume 1},
  pages     = {331--340},
  publisher = {{INSTICC} Press},
  year      = {2009},
  timestamp = {Fri, 07 Jan 2011 13:47:44 +0100},
  biburl    = {https://dblp.org/rec/conf/visapp/MujaL09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cvpr/BeisL97,
  author    = {Jeffrey S. Beis and
               David G. Lowe},
  title     = {Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional
               Spaces},
  booktitle = {1997 Conference on Computer Vision and Pattern Recognition {(CVPR}
               '97), June 17-19, 1997, San Juan, Puerto Rico},
  pages     = {1000--1006},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
  url       = {https://doi.org/10.1109/CVPR.1997.609451},
  doi       = {10.1109/CVPR.1997.609451},
  timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
  biburl    = {https://dblp.org/rec/conf/cvpr/BeisL97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cvpr/Silpa-AnanH08,
  author    = {Chanop Silpa{-}Anan and
               Richard I. Hartley},
  title     = {Optimised KD-trees for fast image descriptor matching},
  booktitle = {2008 {IEEE} Computer Society Conference on Computer Vision and Pattern
               Recognition {(CVPR} 2008), 24-26 June 2008, Anchorage, Alaska, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2008},
  url       = {https://doi.org/10.1109/CVPR.2008.4587638},
  doi       = {10.1109/CVPR.2008.4587638},
  timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
  biburl    = {https://dblp.org/rec/conf/cvpr/Silpa-AnanH08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Sproull91,
  author    = {Robert F. Sproull},
  title     = {Refinements to Nearest-Neighbor Searching in k-Dimensional Trees},
  journal   = {Algorithmica},
  volume    = {6},
  number    = {4},
  pages     = {579--589},
  year      = {1991},
  url       = {https://doi.org/10.1007/BF01759061},
  doi       = {10.1007/BF01759061},
  timestamp = {Wed, 17 May 2017 14:25:12 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/Sproull91.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/DasguptaF08,
  author    = {Sanjoy Dasgupta and
               Yoav Freund},
  editor    = {Cynthia Dwork},
  title     = {Random projection trees and low dimensional manifolds},
  booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
               Victoria, British Columbia, Canada, May 17-20, 2008},
  pages     = {537--546},
  publisher = {{ACM}},
  year      = {2008},
  url       = {https://doi.org/10.1145/1374376.1374452},
  doi       = {10.1145/1374376.1374452},
  timestamp = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/DasguptaF08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cvpr/JiaWZZH10,
  author    = {You Jia and
               Jingdong Wang and
               Gang Zeng and
               Hongbin Zha and
               Xian{-}Sheng Hua},
  title     = {Optimizing kd-trees for scalable visual descriptor indexing},
  booktitle = {The Twenty-Third {IEEE} Conference on Computer Vision and Pattern
               Recognition, {CVPR} 2010, San Francisco, CA, USA, 13-18 June 2010},
  pages     = {3392--3399},
  publisher = {{IEEE} Computer Society},
  year      = {2010},
  url       = {https://doi.org/10.1109/CVPR.2010.5540006},
  doi       = {10.1109/CVPR.2010.5540006},
  timestamp = {Thu, 25 Mar 2021 13:19:49 +0100},
  biburl    = {https://dblp.org/rec/conf/cvpr/JiaWZZH10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tc/FukunagaN75,
  author    = {Keinosuke Fukunaga and
               Patrenahalli M. Narendra},
  title     = {A Branch and Bound Algorithms for Computing k-nearest Neighbors},
  journal   = {{IEEE} Trans. Computers},
  volume    = {24},
  number    = {7},
  pages     = {750--753},
  year      = {1975},
  url       = {https://doi.org/10.1109/T-C.1975.224297},
  doi       = {10.1109/T-C.1975.224297},
  timestamp = {Wed, 14 Nov 2018 10:48:32 +0100},
  biburl    = {https://dblp.org/rec/journals/tc/FukunagaN75.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/vldb/Brin95,
  author    = {Sergey Brin},
  editor    = {Umeshwar Dayal and
               Peter M. D. Gray and
               Shojiro Nishio},
  title     = {Near Neighbor Search in Large Metric Spaces},
  booktitle = {VLDB'95, Proceedings of 21th International Conference on Very Large
               Data Bases, September 11-15, 1995, Zurich, Switzerland},
  pages     = {574--584},
  publisher = {Morgan Kaufmann},
  year      = {1995},
  url       = {http://www.vldb.org/conf/1995/P574.PDF},
  timestamp = {Tue, 20 Feb 2018 15:19:44 +0100},
  biburl    = {https://dblp.org/rec/conf/vldb/Brin95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/uai/Moore00,
  author    = {Andrew W. Moore},
  editor    = {Craig Boutilier and
               Mois{\'{e}}s Goldszmidt},
  title     = {The Anchors Hierarchy: Using the Triangle Inequality to Survive High
               Dimensional Data},
  booktitle = {{UAI} '00: Proceedings of the 16th Conference in Uncertainty in Artificial
               Intelligence, Stanford University, Stanford, California, USA, June
               30 - July 3, 2000},
  pages     = {397--405},
  publisher = {Morgan Kaufmann},
  year      = {2000},
  url       = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\&smnu=2\&article\_id=47\&proceeding\_id=16},
  timestamp = {Wed, 03 Feb 2021 11:09:10 +0100},
  biburl    = {https://dblp.org/rec/conf/uai/Moore00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/Yianilos93,
  author    = {Peter N. Yianilos},
  editor    = {Vijaya Ramachandran},
  title     = {Data Structures and Algorithms for Nearest Neighbor Search in General
               Metric Spaces},
  booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 25-27 January 1993, Austin, Texas, {USA}},
  pages     = {311--321},
  publisher = {{ACM/SIAM}},
  year      = {1993},
  url       = {http://dl.acm.org/citation.cfm?id=313559.313789},
  timestamp = {Thu, 05 Jul 2018 07:29:11 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/Yianilos93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2201-06553,
  author    = {Yury Elkin and
               Vitaliy Kurlin},
  title     = {Paired compressed cover trees guarantee a near linear parametrized
               complexity for all k-nearest neighbors search in an arbitrary metric
               space},
  journal   = {CoRR},
  volume    = {abs/2201.06553},
  year      = {2022},
  url       = {https://arxiv.org/abs/2201.06553},
  eprinttype = {arXiv},
  eprint    = {2201.06553},
  timestamp = {Fri, 21 Jan 2022 13:57:15 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2201-06553.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/nips/LiuMGY04,
  author    = {Ting Liu and
               Andrew W. Moore and
               Alexander G. Gray and
               Ke Yang},
  title     = {An Investigation of Practical Approximate Nearest Neighbor Algorithms},
  booktitle = {Advances in Neural Information Processing Systems 17 [Neural Information
               Processing Systems, {NIPS} 2004, December 13-18, 2004, Vancouver,
               British Columbia, Canada]},
  pages     = {825--832},
  year      = {2004},
  url       = {https://proceedings.neurips.cc/paper/2004/hash/1102a326d5f7c9e04fc3c89d0ede88c9-Abstract.html},
  timestamp = {Thu, 21 Jan 2021 15:15:25 +0100},
  biburl    = {https://dblp.org/rec/conf/nips/LiuMGY04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cvpr/NisterS06,
  author    = {David Nist{\'{e}}r and
               Henrik Stew{\'{e}}nius},
  title     = {Scalable Recognition with a Vocabulary Tree},
  booktitle = {2006 {IEEE} Computer Society Conference on Computer Vision and Pattern
               Recognition {(CVPR} 2006), 17-22 June 2006, New York, NY, {USA}},
  pages     = {2161--2168},
  publisher = {{IEEE} Computer Society},
  year      = {2006},
  url       = {https://doi.org/10.1109/CVPR.2006.264},
  doi       = {10.1109/CVPR.2006.264},
  timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
  biburl    = {https://dblp.org/rec/conf/cvpr/NisterS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/bmvc/LeibeMS06,
  author    = {Bastian Leibe and
               Krystian Mikolajczyk and
               Bernt Schiele},
  editor    = {Mike J. Chantler and
               Robert B. Fisher and
               Emanuele Trucco},
  title     = {Efficient Clustering and Matching for Object Class Recognition},
  booktitle = {Proceedings of the British Machine Vision Conference 2006, Edinburgh,
               UK, September 4-7, 2006},
  pages     = {789--798},
  publisher = {British Machine Vision Association},
  year      = {2006},
  url       = {https://doi.org/10.5244/C.20.81},
  doi       = {10.5244/C.20.81},
  timestamp = {Wed, 03 Feb 2021 08:35:19 +0100},
  biburl    = {https://dblp.org/rec/conf/bmvc/LeibeMS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cvpr/PhilbinCISZ07,
  author    = {James Philbin and
               Ondrej Chum and
               Michael Isard and
               Josef Sivic and
               Andrew Zisserman},
  title     = {Object retrieval with large vocabularies and fast spatial matching},
  booktitle = {2007 {IEEE} Computer Society Conference on Computer Vision and Pattern
               Recognition {(CVPR} 2007), 18-23 June 2007, Minneapolis, Minnesota,
               {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2007},
  url       = {https://doi.org/10.1109/CVPR.2007.383172},
  doi       = {10.1109/CVPR.2007.383172},
  timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
  biburl    = {https://dblp.org/rec/conf/cvpr/PhilbinCISZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/fcsc/LiH20,
  author    = {Linhao Li and
               Qinghua Hu},
  title     = {Optimized high order product quantization for approximate nearest
               neighbors search},
  journal   = {Frontiers Comput. Sci.},
  volume    = {14},
  number    = {2},
  pages     = {259--272},
  year      = {2020},
  url       = {https://doi.org/10.1007/s11704-018-7049-5},
  doi       = {10.1007/s11704-018-7049-5},
  timestamp = {Fri, 27 Mar 2020 08:41:09 +0100},
  biburl    = {https://dblp.org/rec/journals/fcsc/LiH20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/Panigrahy06,
  author    = {Rina Panigrahy},
  title     = {Entropy based nearest neighbor search in high dimensions},
  booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages     = {1186--1195},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557.1109688},
  timestamp = {Fri, 07 Dec 2012 17:02:09 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Panigrahy06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/IndykM98,
  author    = {Piotr Indyk and
               Rajeev Motwani},
  editor    = {Jeffrey Scott Vitter},
  title     = {Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality},
  booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
               of Computing, Dallas, Texas, USA, May 23-26, 1998},
  pages     = {604--613},
  publisher = {{ACM}},
  year      = {1998},
  url       = {https://doi.org/10.1145/276698.276876},
  doi       = {10.1145/276698.276876},
  timestamp = {Thu, 02 Jan 2020 12:13:44 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/IndykM98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sequences/Broder97,
  author    = {Andrei Z. Broder},
  editor    = {Bruno Carpentieri and
               Alfredo De Santis and
               Ugo Vaccaro and
               James A. Storer},
  title     = {On the resemblance and containment of documents},
  booktitle = {Compression and Complexity of {SEQUENCES} 1997, Positano, Amalfitan
               Coast, Salerno, Italy, June 11-13, 1997, Proceedings},
  pages     = {21--29},
  publisher = {{IEEE}},
  year      = {1997},
  url       = {https://doi.org/10.1109/SEQUEN.1997.666900},
  doi       = {10.1109/SEQUEN.1997.666900},
  timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
  biburl    = {https://dblp.org/rec/conf/sequences/Broder97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/www/BawaCG05,
  author    = {Mayank Bawa and
               Tyson Condie and
               Prasanna Ganesan},
  editor    = {Allan Ellis and
               Tatsuya Hagino},
  title     = {{LSH} forest: self-tuning indexes for similarity search},
  booktitle = {Proceedings of the 14th international conference on World Wide Web,
               {WWW} 2005, Chiba, Japan, May 10-14, 2005},
  pages     = {651--660},
  publisher = {{ACM}},
  year      = {2005},
  url       = {https://doi.org/10.1145/1060745.1060840},
  doi       = {10.1145/1060745.1060840},
  timestamp = {Tue, 06 Nov 2018 16:57:08 +0100},
  biburl    = {https://dblp.org/rec/conf/www/BawaCG05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigmod/GanFFN12,
  author    = {Junhao Gan and
               Jianlin Feng and
               Qiong Fang and
               Wilfred Ng},
  editor    = {K. Sel{\c{c}}uk Candan and
               Yi Chen and
               Richard T. Snodgrass and
               Luis Gravano and
               Ariel Fuxman},
  title     = {Locality-sensitive hashing scheme based on dynamic collision counting},
  booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management
               of Data, {SIGMOD} 2012, Scottsdale, AZ, USA, May 20-24, 2012},
  pages     = {541--552},
  publisher = {{ACM}},
  year      = {2012},
  url       = {https://doi.org/10.1145/2213836.2213898},
  doi       = {10.1145/2213836.2213898},
  timestamp = {Tue, 06 Nov 2018 11:07:39 +0100},
  biburl    = {https://dblp.org/rec/conf/sigmod/GanFFN12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/is/MalkovPLK14,
  author    = {Yury Malkov and
               Alexander Ponomarenko and
               Andrey Logvinov and
               Vladimir Krylov},
  title     = {Approximate nearest neighbor algorithm based on navigable small world
               graphs},
  journal   = {Inf. Syst.},
  volume    = {45},
  pages     = {61--68},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.is.2013.10.006},
  doi       = {10.1016/j.is.2013.10.006},
  timestamp = {Wed, 14 Nov 2018 10:26:47 +0100},
  biburl    = {https://dblp.org/rec/journals/is/MalkovPLK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pami/MalkovY20,
  author    = {Yury A. Malkov and
               Dmitry A. Yashunin},
  title     = {Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical
               Navigable Small World Graphs},
  journal   = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
  volume    = {42},
  number    = {4},
  pages     = {824--836},
  year      = {2020},
  url       = {https://doi.org/10.1109/TPAMI.2018.2889473},
  doi       = {10.1109/TPAMI.2018.2889473},
  timestamp = {Thu, 26 Aug 2021 08:49:45 +0200},
  biburl    = {https://dblp.org/rec/journals/pami/MalkovY20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pvldb/NaidanBN15,
  author    = {Bilegsaikhan Naidan and
               Leonid Boytsov and
               Eric Nyberg},
  title     = {Permutation Search Methods are Efficient, Yet Faster Search is Possible},
  journal   = {Proc. {VLDB} Endow.},
  volume    = {8},
  number    = {12},
  pages     = {1618--1629},
  year      = {2015},
  url       = {http://www.vldb.org/pvldb/vol8/p1618-naidan.pdf},
  doi       = {10.14778/2824032.2824059},
  timestamp = {Sat, 25 Apr 2020 13:59:03 +0200},
  biburl    = {https://dblp.org/rec/journals/pvldb/NaidanBN15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2005-13255,
  author    = {Carlo Vittorio Cannistraci and
               Alessandro Muscoloni},
  title     = {Geometrical congruence and efficient greedy navigability of complex
               networks},
  journal   = {CoRR},
  volume    = {abs/2005.13255},
  year      = {2020},
  url       = {https://arxiv.org/abs/2005.13255},
  eprinttype = {arXiv},
  eprint    = {2005.13255},
  timestamp = {Thu, 28 May 2020 17:38:09 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2005-13255.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Malkov15,
  author    = {Yury A. Malkov},
  title     = {Growing homophilic networks are natural optimal navigable small worlds},
  journal   = {CoRR},
  volume    = {abs/1507.06529},
  year      = {2015},
  url       = {http://arxiv.org/abs/1507.06529},
  eprinttype = {arXiv},
  eprint    = {1507.06529},
  timestamp = {Mon, 13 Aug 2018 16:47:57 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Malkov15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pvldb/FuXWC19,
  author    = {Cong Fu and
               Chao Xiang and
               Changxu Wang and
               Deng Cai},
  title     = {Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out
               Graph},
  journal   = {Proc. {VLDB} Endow.},
  volume    = {12},
  number    = {5},
  pages     = {461--474},
  year      = {2019},
  url       = {http://www.vldb.org/pvldb/vol12/p461-fu.pdf},
  doi       = {10.14778/3303753.3303754},
  timestamp = {Wed, 13 Jan 2021 12:32:58 +0100},
  biburl    = {https://dblp.org/rec/journals/pvldb/FuXWC19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cvpr/HarwoodD16,
  author    = {Ben Harwood and
               Tom Drummond},
  title     = {{FANNG:} Fast Approximate Nearest Neighbour Graphs},
  booktitle = {2016 {IEEE} Conference on Computer Vision and Pattern Recognition,
               {CVPR} 2016, Las Vegas, NV, USA, June 27-30, 2016},
  pages     = {5713--5722},
  publisher = {{IEEE} Computer Society},
  year      = {2016},
  url       = {https://doi.org/10.1109/CVPR.2016.616},
  doi       = {10.1109/CVPR.2016.616},
  timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
  biburl    = {https://dblp.org/rec/conf/cvpr/HarwoodD16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sisap/Iwasaki16,
  author    = {Masajiro Iwasaki},
  editor    = {Laurent Amsaleg and
               Michael E. Houle and
               Erich Schubert},
  title     = {Pruned Bi-directed K-nearest Neighbor Graph for Proximity Search},
  booktitle = {Similarity Search and Applications - 9th International Conference,
               {SISAP} 2016, Tokyo, Japan, October 24-26, 2016. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9939},
  pages     = {20--33},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-319-46759-7\_2},
  doi       = {10.1007/978-3-319-46759-7\_2},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/conf/sisap/Iwasaki16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1810-07355,
  author    = {Masajiro Iwasaki and
               Daisuke Miyazaki},
  title     = {Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity
               Search in High-dimensional Data},
  journal   = {CoRR},
  volume    = {abs/1810.07355},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.07355},
  eprinttype = {arXiv},
  eprint    = {1810.07355},
  timestamp = {Tue, 30 Oct 2018 20:39:56 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1810-07355.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/kdd/AoyamaSSU11,
  author    = {Kazuo Aoyama and
               Kazumi Saito and
               Hiroshi Sawada and
               Naonori Ueda},
  editor    = {Chid Apt{\'{e}} and
               Joydeep Ghosh and
               Padhraic Smyth},
  title     = {Fast approximate similarity search based on degree-reduced neighborhood
               graphs},
  booktitle = {Proceedings of the 17th {ACM} {SIGKDD} International Conference on
               Knowledge Discovery and Data Mining, San Diego, CA, USA, August 21-24,
               2011},
  pages     = {1055--1063},
  publisher = {{ACM}},
  year      = {2011},
  url       = {https://doi.org/10.1145/2020408.2020576},
  doi       = {10.1145/2020408.2020576},
  timestamp = {Tue, 06 Nov 2018 16:59:37 +0100},
  biburl    = {https://dblp.org/rec/conf/kdd/AoyamaSSU11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pvldb/WangXY021,
  author    = {Mengzhao Wang and
               Xiaoliang Xu and
               Qiang Yue and
               Yuxiang Wang},
  title     = {A Comprehensive Survey and Experimental Comparison of Graph-Based
               Approximate Nearest Neighbor Search},
  journal   = {Proc. {VLDB} Endow.},
  volume    = {14},
  number    = {11},
  pages     = {1964--1978},
  year      = {2021},
  url       = {http://www.vldb.org/pvldb/vol14/p1964-wang.pdf},
  timestamp = {Fri, 27 Aug 2021 17:02:27 +0200},
  biburl    = {https://dblp.org/rec/journals/pvldb/WangXY021.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigmod/GalakatosMBFK19,
  author    = {Alex Galakatos and
               Michael Markovitch and
               Carsten Binnig and
               Rodrigo Fonseca and
               Tim Kraska},
  title     = {FITing-Tree: {A} Data-aware Index Structure},
  booktitle = {Proceedings of the 2019 International Conference on Management of
               Data, {SIGMOD} Conference 2019, Amsterdam, The Netherlands, June 30
               - July 5, 2019},
  pages     = {1189--1206},
  publisher = {{ACM}},
  year      = {2019}
}

@article{DBLP:journals/air/Goyal22,
  author    = {Somya Goyal},
  title     = {Handling Class-Imbalance with {KNN} (Neighbourhood) Under-Sampling
               for Software Defect Prediction},
  journal   = {Artif. Intell. Rev.},
  volume    = {55},
  number    = {3},
  pages     = {2023--2064},
  year      = {2022},
  url       = {https://doi.org/10.1007/s10462-021-10044-w},
  doi       = {10.1007/s10462-021-10044-w},
  timestamp = {Fri, 25 Mar 2022 09:59:20 +0100},
  biburl    = {https://dblp.org/rec/journals/air/Goyal22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/entropy/SongL22,
  author    = {Chaohong Song and
               Xinran Li},
  title     = {Cost-Sensitive {KNN} Algorithm for Cancer Prediction Based on Entropy
               Analysis},
  journal   = {Entropy},
  volume    = {24},
  number    = {2},
  pages     = {253},
  year      = {2022},
  url       = {https://doi.org/10.3390/e24020253},
  doi       = {10.3390/e24020253},
  timestamp = {Tue, 15 Mar 2022 10:20:12 +0100},
  biburl    = {https://dblp.org/rec/journals/entropy/SongL22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/wicomm/VeenaMTKR22,
  author    = {K. Veena and
               K. Meena and
               Yuvaraja Teekaraman and
               Ramya Kuppusamy and
               Arun Radhakrishnan},
  title     = {C {SVM} Classification and {KNN} Techniques for Cyber Crime Detection},
  journal   = {Wirel. Commun. Mob. Comput.},
  volume    = {2022},
  pages     = {3640017:1--3640017:9},
  year      = {2022},
  url       = {https://doi.org/10.1155/2022/3640017},
  doi       = {10.1155/2022/3640017},
  timestamp = {Fri, 21 Jan 2022 21:59:25 +0100},
  biburl    = {https://dblp.org/rec/journals/wicomm/VeenaMTKR22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/access/KimCPLN21,
  author    = {Jeong{-}Hun Kim and
               Jong{-}Hyeok Choi and
               Young{-}Ho Park and
               Carson Kai{-}Sang Leung and
               Aziz Nasridinov},
  title     = {{KNN-SC:} Novel Spectral Clustering Algorithm Using k-Nearest Neighbors},
  journal   = {{IEEE} Access},
  volume    = {9},
  pages     = {152616--152627},
  year      = {2021},
  url       = {https://doi.org/10.1109/ACCESS.2021.3126854},
  doi       = {10.1109/ACCESS.2021.3126854},
  timestamp = {Wed, 15 Dec 2021 10:27:50 +0100},
  biburl    = {https://dblp.org/rec/journals/access/KimCPLN21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mta/MaityPB21,
  author    = {Arunit Maity and
               P. Prakasam and
               Sarthak Bhargava},
  title     = {Machine learning based {KNN} classifier: towards robust, efficient
               {DTMF} tone detection for a Noisy environment},
  journal   = {Multim. Tools Appl.},
  volume    = {80},
  number    = {19},
  pages     = {29765--29784},
  year      = {2021},
  url       = {https://doi.org/10.1007/s11042-021-11194-3},
  doi       = {10.1007/s11042-021-11194-3},
  timestamp = {Thu, 26 Aug 2021 11:34:30 +0200},
  biburl    = {https://dblp.org/rec/journals/mta/MaityPB21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/kais/LevchenkoKYAMPS21,
  author    = {Oleksandra Levchenko and
               Boyan Kolev and
               Djamel Edine Yagoubi and
               Reza Akbarinia and
               Florent Masseglia and
               Themis Palpanas and
               Dennis E. Shasha and
               Patrick Valduriez},
  title     = {BestNeighbor: efficient evaluation of kNN queries on large time series
               databases},
  journal   = {Knowl. Inf. Syst.},
  volume    = {63},
  number    = {2},
  pages     = {349--378},
  year      = {2021},
  url       = {https://doi.org/10.1007/s10115-020-01518-4},
  doi       = {10.1007/s10115-020-01518-4},
  timestamp = {Thu, 11 Feb 2021 11:54:28 +0100},
  biburl    = {https://dblp.org/rec/journals/kais/LevchenkoKYAMPS21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/ethos/Cahsai20,
  author    = {Atoshum Cahsai},
  title     = {Scaling kNN queries using statistical learning},
  school    = {University of Glasgow, {UK}},
  year      = {2020},
  url       = {https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.810533},
  timestamp = {Tue, 05 Apr 2022 10:58:54 +0200},
  biburl    = {https://dblp.org/rec/phd/ethos/Cahsai20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejwcn/RenHWH22,
  author    = {Feiyang Ren and
               Yi Han and
               Shaohan Wang and
               Jian He},
  title     = {A novel high-dimensional trajectories construction network based on
               multi-clustering algorithm},
  journal   = {{EURASIP} J. Wirel. Commun. Netw.},
  volume    = {2022},
  number    = {1},
  pages     = {18},
  year      = {2022},
  url       = {https://doi.org/10.1186/s13638-022-02108-4},
  doi       = {10.1186/s13638-022-02108-4},
  timestamp = {Thu, 31 Mar 2022 17:13:20 +0200},
  biburl    = {https://dblp.org/rec/journals/ejwcn/RenHWH22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2204-02351,
  author    = {Mansur Arief and
               Zhepeng Cen and
               Zhenyuan Liu and
               Zhiyuan Huang and
               Henry Lam and
               Bo Li and
               Ding Zhao},
  title     = {Test Against High-Dimensional Uncertainties: Accelerated Evaluation
               of Autonomous Vehicles with Deep Importance Sampling},
  journal   = {CoRR},
  volume    = {abs/2204.02351},
  year      = {2022},
  url       = {https://doi.org/10.48550/arXiv.2204.02351},
  doi       = {10.48550/arXiv.2204.02351},
  eprinttype = {arXiv},
  eprint    = {2204.02351},
  timestamp = {Wed, 06 Apr 2022 14:29:31 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2204-02351.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/access/NespoliLMO22,
  author    = {Alfredo Nespoli and
               Sonia Leva and
               Marco Mussetta and
               Emanuele Giovanni Carlo Ogliari},
  title     = {A Selective Ensemble Approach for Accuracy Improvement and Computational
               Load Reduction in ANN-Based {PV} Power Forecasting},
  journal   = {{IEEE} Access},
  volume    = {10},
  pages     = {32900--32911},
  year      = {2022},
  url       = {https://doi.org/10.1109/ACCESS.2022.3158364},
  doi       = {10.1109/ACCESS.2022.3158364},
  timestamp = {Fri, 01 Apr 2022 16:59:58 +0200},
  biburl    = {https://dblp.org/rec/journals/access/NespoliLMO22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithms/Gorniak22,
  author    = {Piotr G{\'{o}}rniak},
  title     = {Modeling of the 5G-Band Patch Antennas Using ANNs under the Uncertainty
               of the Geometrical Design Parameters Associated with the Manufacturing
               Process},
  journal   = {Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {7},
  year      = {2022},
  url       = {https://doi.org/10.3390/a15010007},
  doi       = {10.3390/a15010007},
  timestamp = {Fri, 25 Feb 2022 16:59:42 +0100},
  biburl    = {https://dblp.org/rec/journals/algorithms/Gorniak22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comcom/ValleroRMM22,
  author    = {Greta Vallero and
               Daniela Renga and
               Michela Meo and
               Marco Ajmone Marsan},
  title     = {{RAN} energy efficiency and failure rate through {ANN} traffic predictions
               processing},
  journal   = {Comput. Commun.},
  volume    = {183},
  pages     = {51--63},
  year      = {2022},
  url       = {https://doi.org/10.1016/j.comcom.2021.11.011},
  doi       = {10.1016/j.comcom.2021.11.011},
  timestamp = {Tue, 08 Feb 2022 10:43:22 +0100},
  biburl    = {https://dblp.org/rec/journals/comcom/ValleroRMM22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{2016Categorical,
  title={Categorical Reparameterization with Gumbel-Softmax},
  author={ Jang, E.  and  Gu, S.  and  Poole, B. },
  journal={arXiv e-prints},
  year={2016},
}
@article{2017The,
  title={The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables},
  author={ Maddison, C. J.  and  Mnih, A.  and  Teh, Y. W. },
  year={2017},
}
@article{黎玲利2012XML,
  title={XML数据流上Top-K关键字查询处理},
  author={黎玲利 and 王宏志 and 高宏 and 李建中},
  journal={软件学报},
  volume={23},
  number={6},
  pages={17},
  year={2012},
}
@phdthesis{黎玲利0实体识别关键技术的研究,
  title={实体识别关键技术的研究},
  author={黎玲利},
  school={哈尔滨工业大学},
}